GOSH! Gossiping Optimization Search Heuristics∗
نویسندگان
چکیده
While the use of distributed computing in search and optimization problems has a long research history, most efforts have been devoted to parallel implementations with strict synchronization requirements or to distributed architectures where a central server coordinates the work of clients by partitioning the search space or working as a status repository. In this paper we discuss the distributed implementation of global function optimization through decentralized processing in a peer-to-peer fashion, where relevant information is exchanged among nodes by means of epidemic protocols. A key issue in such setting is the degradation of the quality of the solution due to the lack of complete information about the global search status. A tradeoff between message complexity and solution quality must
منابع مشابه
A powerful heuristic for telephone gossiping
A refined heuristic for computing schedules for gossiping in the telephone model is presented. The heuristic is fast: for a network with n nodes and m edges, requiring R rounds for gossiping, the running time is O(R n log n m) for all tested classes of graphs. This moderate time consumption allows to compute gossiping schedules for networks with more than 10,000 PUs and 100,000 connections. The...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملGOssiping Optimization Framework (GOOF): A decentralized P2P architecture for function optimization
This thesis discusses the implementation of function optimization algorithms through distributed and decentralized processing in a peer-to-peer fashion. Our research is focused on a fully decentralized, general purpose P2P environment, with no special or ad-hoc facility for executing optimization tasks. Relevant information is exchanged among nodes by means of epidemic protocols, exploiting the...
متن کاملKOLMOGOROV-SMIRNOV TEST TO TACKLE FAIR COMPARISON OF HEURISTIC APPROACHES IN STRUCTURAL OPTIMIZATION
This paper provides a test method to make a fair comparison between different heuristics in structure optimization. When statistical methods are applied to the structural optimization (namely heuristics or meta-heuristics with several tunable parameters and starting seeds), the "one problem - one result" is extremely far from the fair comparison. From statistical point of view, the minimal requ...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007